On optimal guillotine partitions approximating optimal d-box partitions
نویسندگان
چکیده
منابع مشابه
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions
Given a set of n points, P, in E d (the plane when d = 2) that lie inside a d-box (rectangle when d = 2) R, we study the problem of partitioning R into d-boxes by introducing a set of orthogonal hyperplane segments (line segments when d = 2) whose total (d?1)-volume (length when d = 2) is the least possible. In a valid d-box partition, each point in P must be included in at least one partitioni...
متن کاملSeparable d-Permutations and Guillotine Partitions
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula, and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between separable d-dimensional permutations and guillotine partitions of a 2d−1-dimensional bo...
متن کاملCut equivalence of d-dimensional guillotine partitions
A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) I...
متن کاملOptimal Partitions for Eigenvalues
We introduce a new numerical method to approximate partitions of a domain minimizing the sum of Dirichlet-Laplacian eigenvalues of any order. First we prove the equivalence of the original problem and a relaxed formulation based on measures. Using this result, we build a numerical algorithm to approximate optimal configurations. We describe numerical experiments aimed at studying the asymptotic...
متن کاملPartitions for Optimal Approximations
The Riemann integral can be approximated using partitions and a rule for assigning weighted sums of the function at points determined by the partition. Approximation methods commonly used include endpoint rules, the midpoint rule, the trapezoid rule, Simpson’s rule, and other quadrature methods. The rate of approximation depends to a large degree on the rule being used and the smoothness of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1994
ISSN: 0925-7721
DOI: 10.1016/0925-7721(94)90013-2